Combinatorics of branchings in higher dimensional automata
نویسنده
چکیده
We explore the combinatorial properties of the branching areas of paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner homology of a globular ω-category and the combinatorics of a new homology theory called the reduced negative corner homology. This latter is the homology of the quotient of the corner complex by the sub-complex generated by its thin elements. As application, we calculate the corner homology of some ω-categories and we give some invariance results for the reduced corner homology. We only treat the negative side. The positive side, that is to say the case of merging areas of paths is similar and can be easily deduced from the negative side.
منابع مشابه
Homological Properties of Non-deterministic Branchings and Mergings in Higher Dimensional Automata
The branching (resp. merging) space functor of a flow is a left Quillen functor. The associated derived functor allows to define the branching (resp. merging) homology of a flow. It is then proved that this homology theory is a dihomotopy invariant and that higher dimensional branchings (resp. mergings) satisfy a long exact sequence.
متن کاملHigher Dimensional Automata
We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define recognizable, regular and rational sets of series-parallel biposets and study their relationship. Moreover, we relate these classes to languages of series-parallel biposets definable in monadic second-order logic.
متن کاملPalindromes and Two-Dimensional Sturmian Sequences
This paper introduces a two-dimensional notion of palindrome for rectangular factors of double sequences: these palindromes are deened as centrosym-metric factors. This notion provides a characterization of two-dimensional Sturmian sequences in terms of two-dimensional palindromes, generalizing to double sequences the results in 12].
متن کاملCoding of Two-Dimensional Constraints of Finite Type by Substitutions
We give an automatic method to generate transition matrices associated with twodimensional contraints of finite type by using squared substitutions of constant dimension.
متن کاملFormal Language Characterizations of P, NP, and PSPACE
Based on the notions of locality and recognizability for n-dimensional languages n-dimensionally colorable 1-dimensional languages are introduced. It is shown: A language L is in NP if and only if L is n-dimensionally colorable for some n. An analogous characterization in terms of deterministic n-dimensional colorability is obtained for P. The addition of one unbounded dimension for coloring le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره math.CT/9912059 شماره
صفحات -
تاریخ انتشار 1999